package cn.amsser.myshowcase.arithmetic.search;


public class SequentialSearch {

	public static int search(int[] source) {

		int temp = 0;

		for (int i = 0; i < source.length; i++) {
			if (temp == source[i]) {
				return i;
			}
		}

		return source.length;

	}

}
